Binary Analysis for Measurement and Attribution of Program Performance Nathan R. Tallent John M. Mellor-Crummey

Source URL: www.hpctoolkit.org

• Subroutines
• Call stack
• Stack
• Pointer
• Optimizing compiler
• Tail call
• Inline expansion
• Profiling
• Function prologue
• Fortran
• Call graph
• C dynamic memory allocation

Precise Call Graph Construction in the Presence of Function Pointers∗ Ana Milanova Atanas Rountev Barbara G. Ryder Department of Computer Science

Source URL: www.cs.rpi.edu

HI-CFG: Construction by Binary Analysis, and Application to Attack Polymorphism Dan Caselden1 , Alex Bazhanyuk2 , Mathias Payer3 , Stephen McCamant4 , and Dawn Song3 1

Source URL: hexhive.github.io

• Computing
• Software engineering
• Memory management
• Software
• Computer memory
• Program analysis
• Control flow graph
• Data-flow analysis
• Data buffer
• C dynamic memory allocation
• Stack
• Call stack

Interactive Code Execution Profiling Alexandre Bergel PLEIAD Lab, Department of Computer Science (DCC), University of Chile http://bergel.eu 1.

Source URL: liveprogramming.github.io

• Software engineering
• Computer programming
• Software development
• Software optimization
• Aspect-oriented software development
• Profiling
• Compiler construction
• Aspect-oriented programming
• Call graph
• Offender profiling
• Debugger
• Inheritance

Automated Transplantation of Call Graph and Layout Features into Kate Alexandru Marginean, Earl T. Barr, Mark Harman, Yue Jia UCL, Department of Computer Science, CREST Centre Abstract. We report the automated transplan

Source URL: www.alexandrumarginean.com

Universality of graphs with few triangles and anti-triangles Mykhaylo Tyomkyn Call a graph sequence 3-random-like if it contains asymptotically the same number of triangles and empty 3-sets as the random graph Gn,1/2 . T

Source URL: web.mat.bham.ac.uk

Contents Editorial page 1 CONFERENCE CALL 16th Nordic Workshop page 2

Source URL: issi-society.org

• Graph theory
• Discrete mathematics
• Information science
• Bibliometrics
• Graph operations
• Informetrics
• Line graph
• Scientometrics
• Hirsch
• ISSI
• Core
• Graph

Binary Analysis for Measurement and Attribution of Program Performance Nathan R. Tallent John M. Mellor-Crummey

Source URL: www.cs.rice.edu

• Subroutines
• Call stack
• Stack
• Pointer
• Optimizing compiler
• Tail call
• Inline expansion
• Profiling
• Function prologue
• Fortran
• Call graph
• C dynamic memory allocation

Scalable Propagation-Based Call Graph Construction Algorithms Frank Tip Jens Palsberg

Source URL: www.franktip.org

Sixth International Conference on Graph Transformation ICGT 2012 – Modeling and Analysis of Dynamic Structures – University of Bremen, Germany 24 – 29 September, 2012 2nd Call for Papers

Source URL: www.informatik.uni-bremen.de